Discrete Logarithms: Recent Progress
نویسندگان
چکیده
We summarize recent developments on the computation of discrete logarithms in general groups as well as in some specialized settings. More specifically , we consider the following abelian groups: the multiplicative group of nite elds, the group of points of an elliptic curve over a nite eld, and the class group of quadratic number elds.
منابع مشابه
Discrete Logarithms in Finite Fields and Their Cryptographic Significance
Given a primitive element g of a finite field GF(q), the discrete logarithm of a nonzero element u ∈ GF(q) is that integer k, 1 ≤ k ≤ q − 1, for which u = g k . The well-known problem of computing discrete logarithms in finite fields has acquired additional importance in recent years due to its applicability in cryptography. Several cryptographic systems would become insecure if an efficient di...
متن کاملComputing discrete logarithms in cryptographically-interesting characteristic-three finite fields
Since 2013 there have been several developments in algorithms for computing discrete logarithms in small-characteristic finite fields, culminating in a quasipolynomial algorithm. In this paper, we report on our successful computation of discrete logarithms in the cryptographically-interesting characteristic-three finite field F36·509 using these new algorithms; prior to 2013, it was believed th...
متن کاملIndiscreet logarithms in finite fields of small characteristic
Recently, several striking advances have taken place regarding the discrete logarithm problem (DLP) in finite fields of small characteristic, despite progress having remained essentially static for nearly thirty years, with the best known algorithms being of subexponential complexity. In this expository article we describe the key insights and constructions which culminated in two independent q...
متن کاملThe Number Field Sieve in the Medium Prime Case
In this paper, we study several variations of the number field sieve to compute discrete logarithms in finite fields of the form Fpn , with p a medium to large prime. We show that when n is not too large, this yields a Lpn(1/3) algorithm with efficiency similar to that of the regular number field sieve over prime fields. This approach complements the recent results of Joux and Lercier on the fu...
متن کاملComputing discrete logarithms in subfields of residue class rings
Recent breakthrough methods [GGMZ, Jou, BGJT] on computing discrete logarithms in small characteristic finite fields share an interesting feature in common with the earlier medium prime function field sieve method [JL]. To solve discrete logarithms in a finite extension of a finite field F, a polynomial h(x) ∈ F[x] of a special form is constructed with an irreducible factor g(x) ∈ F[x] of the d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998